Making Complex Timing Relationships Readable: Presburger Formula Simplification Using Don’t Cares
نویسندگان
چکیده
Solutions to timing relationship analysis problems are often reported using symbolic variables and inequalities which specify linear relationships between the variables. Complex relationships can be expressed using Presburger formulas which allow Boolean relations to be specified between the inequalities. This paper develops and applies a highly effective simplification approach for Presburger formulas based on logic minimization techniques.
منابع مشابه
Don't Care Computation in Minimizing Extended Finite State Machines with Presburger Arithmetic
This paper addresses the problem of generating logic don’t cares in minimizing an Extended Finite State Machines (EFSMs). EFSMs have been proposed to model control oriented systems. A version of this, with the data portion modeled by Presburger arithmetic, has been used in formal verification. A structural representation of such EFSMs and an optimization scheme using multi-valued logic is propo...
متن کاملSpeciication and Veriication of Temporal Information Using Presburger Formulas
We present a novel set of tools for performing symbolic timing veriication of timing diagrams. The tools are multipurpose with uses in veriication, derivation of synthesis constraints, and design evaluation. Our methodology is based on techniques for manipulating Presburger formulas. We demonstrate via examples that Presburger formulas are very expressive and our veriication results argue that ...
متن کاملWeighted Don’t Cares
In this paper we introduce and discuss the new concept of weighted don’t cares, i.e., we propose to enrich the notion of don’t cares, by assigning them a weight. These weights might be used to guide and refine the choices operated by the minimization algorithms in handling the don’t care conditions. We then propose, and experimentally validate, the first synthesis tool for functions with weight...
متن کاملOn don't cares in test compression
Both test compression tools and ATPGs directly producing compressed test greatly benefit from don’t care values present in the test. Actually, presence of these don’t cares is essential for success of the compression. Contemporary ATPGs produce tests having more than 97% of don’t cares for large industrial circuits, thus high compression ratios can be expected. However, these don’t cares are pl...
متن کاملAn Experimental Evaluation of Algorithms for Computation of Internal Don’t-Cares in Boolean Networks
The goal of this study is to evaluate the efficiency of don’t-care computation in boolean networks using several algorithms. The algorithms are compared using the following three parameters: (1) the amount of don’t-cares generated for the nodes of the network; (2) the sum total of literal counts in the factored forms of all nodes after the generated don’t-cares have been used to simplify each n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998